Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset
نویسندگان
چکیده
—In this paper, a Connected Dominating Set (CDS) construction algorithm CSCDS (Connected Subset based CDS) is proposed, which is based on the connected subset concept. The CSCDS contains two main stages, which are dominating set construction stage and connected dominating set construction stage respectively. In the first stage, the dominators are proposed based on the one hop white neighbor information, and the redundant dominators are reduce to obtain the minimum number of dominators. In the second stage, the CDS is constructed based on the connected subset, which is used as the basis to select the connectors. The message complexity is O(Δ) (O(Δ) is a linear relationship function with Δ, and Δ is the maximum one hop neighbor degree), Simulation results show that CSCDS has smaller size compared with the classical algorithms.
منابع مشابه
ساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکههای حسگر بیسیم
Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from wireless devices with limited resources thus to Long-Term survival of the Network must use energy-efficient mechanisms, algorithms and protocols. one of th...
متن کاملEdge Dominating Capability based Backbone Construction in Wireless Networks
Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks, respectively. Both of the algorithms are based on edge dominating capability which is a novel notion proposed in this paper. Simulations show that each of pro...
متن کاملConstruction of strongly connected dominating sets in asymmetric multihop wireless networks
Consider an asymmetric wireless network represented by a digraph G = (V , E). A subset of vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by U is strongly connected and every vertex not in U has both an in-neighbor in U and an out-neighbor in U . SCDS plays an important role of the virtual backbone in asymmetric wireless networks. Motivated by the constru...
متن کاملEfficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is more suitable for cluster formation is the weakly-connected dominating set (WCDS). We propose an area based distributed algorithm for WCDS formation with time and message complexity O(n). In this Area algorithm, we part...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 11 شماره
صفحات -
تاریخ انتشار 2016